A Logical Semantics for Description Logic Programs
نویسندگان
چکیده
We present a new semantics for Description Logic programs [1] (dlprograms) that combine reasoning about ontologies in description logics with non-monotonic rules interpreted under answer set semantics. Our semantics is equivalent to that of [1], but is more logical in style, being based on the logic QHT of quantified here-and-there that provides a foundation for ordinary logic programs under answer set semantics and removes the need for program reducts. Here we extend the concept of QHT-model to encompass dl-programs. As an application we characterise some logical relations between dl-programs, by mating the idea of QHT-equivalence with the concept of query inseparability taken from description logics.
منابع مشابه
On the Relationship between Logical Bayesian Networks and Probabilistic Logic Programming Based on the Distribution Semantics
A significant part of current research on ILP deals with probabilistic logical models. Over the last decade many logics or languages for representing such models have been introduced. There is currently a great need for insight into the relationships between all these languages. One class of languages are those that extend probabilistic models with elements of logic, such as in the language of ...
متن کاملMapping Logical Bayesian Networks to Probabilistic Logic Programs with Distribution Semantics
A significant part of current research on (inductive) logic programming deals with probabilistic logical models. Over the last decade many logics or languages for representing such models have been introduced. There is currently a great need for insight into the relationships between all these languages. One kind of languages are those that extend probabilistic models with elements of logic, su...
متن کاملCombining Rules and Ontologies via Parametrized Logic Programs
Parametrized logic programs are very expressive logic programs that generalize normal logic programs under the stable model semantics, by allowing complex formulas of a parameter logic to appear in the body and head of rules. In this paper we explore the use of description logics as parameter logics, and show the expressivity of this framework for combining rules and ontologies. Introduction Pa...
متن کاملWell-Founded Inference and 3-Valued Logics
We deene a simple logical semantics based on minimal models in Lukasiewicz's 3-valued logic, L 3. On normal logic programs it is equivalent to the well-founded semantics (WFS), and on disjunctive programs it is equivalent to the P-stable semantics of Eiter, Leone and Saccc a, hence to Przymusinski's 3-valued stable semantics. One advantage is that it is char-acterised by simple conditions on mo...
متن کاملA Fibrational Semantics for Logic Programs
We introduce a new semantics for logic programming languages. It generalises the traditional Herbrand universe semantics, and specialises the semantics of logical relations, as used in analysing parametricity in functional and imperative programming languages. We outline a typed logic programming language, give it this semantics, and show how it supports structured development of logic programs...
متن کامل